Logical Data Partitioning in Bitemporal Databases

نویسندگان

  • Fabrizio d'Amore
  • Roberto Giaccio
چکیده

A bitemporal database is a database explicitly supporting two temporal coordinates, namely the valid time and the transaction time. In this paper we introduce the concept of logical data partitioning in bitemporal databases, where data are partitioned into blocks according to their own natural (temporal) properties and independently on the particular application. In this framework we consider basic user update and query operations, and decompose them into lower level operations within single blocks. Our purpose is to make available a general framework not needing any hypothesis, that allows a cleaner physical design and presents several symmetries in the treatment of blocks, so destroying the natural asymmetry existing between transaction and valid time. Our approach increases system e ciency, as substantiated by both the theoretical and the experimental results which we provide.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An attribute or tuple timestamping in bitemporal relational databases

Much of the research on bitemporal databases has focused on the modeling of time-related data with either attribute or tuple timestamping. While the attribute-timestamping approach attaches bitemporal data to attributes, the tuple-timestamping approach splits the object’s history into several tuples. Although there have been numerous studies on bitemporal data models, there is no work contrasti...

متن کامل

Designing Access Methods for Bitemporal Databases

By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper, we examine the issues involved in designing efficient access methods for bitemporal databases, and propose the partial-persistence and the double-tree methodologies. The partial-persistence methodology reduces bitemporal queries to partial p...

متن کامل

A Bitemporal Storage Structure for a Corporate Data Warehouse

This paper brings together two research areas, i.e. “Data Warehouses” and “Temporal Databases”, involving representation of time. Looking at temporal aspects within a data warehouse, more similarities than differences between temporal databases and data warehouses have been found. The first closeness between these areas consists in the possibility of a data warehouse redefinition in terms of a ...

متن کامل

BtSQL: nested bitemporal relational database query language

A nested bitemporal relational data model and its query language are implemented. The bitemporal atom (BTA) is the fundamental construct to represent temporal data and it contains 5 components: a value, the lower and upper bounds of valid time, and the lower and upper bounds of the recoding time. We consider 2 types of data structures for storing BTAs: 1) string representation and 2) abstract d...

متن کامل

A Proposal for Indexing Bitemporal Databases via Cooperative B+-trees

In this paper we propose an indexing structure for bitemporal databases. Such structure is based on two trees, one indexing valid time and another indexing transaction time. The trees share pointers to the actual data records, which are thus not duplicated. Bitemporal queries are processed by dividing the query in two parts, a valid time part and a transaction time part. Each tree is searched a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998